On Performance Analysis of Hybrid Algorithm (Improved PSO with Simulated Annealing) with GA, PSO for Multiprocessor Job Scheduling
نویسنده
چکیده
Particle Swarm Optimization is currently employed in several optimization and search problems due its ease and ability to find solutions successfully. A variant of PSO, called as Improved PSO has been developed in this paper and is hybridized with the simulated annealing approach to achieve better solutions. The hybrid technique has been employed, inorder to improve the performance of improved PSO. This paper shows the application of hybrid improved PSO in Scheduling multiprocessor tasks. A comparative performance study is reported. It is observed that the proposed hybrid approach gives better solution in solving multiprocessor job scheduling. Key-Words: PSO, Improved PSO, Simulated Annealing, Hybrid Improved PSO, Job Scheduling, Finishing time, waiting time
منابع مشابه
On Performance Analysis of Hybrid Intelligent Algorithms (Improved PSO with SA and Improved PSO with AIS) with GA, PSO for Multiprocessor Job Scheduling
Many heuristic-based approaches have been applied to finding schedules that minimize the execution time of computing tasks on parallel processors. Particle Swarm Optimization is currently employed in several optimization and search problems due its ease and ability to find solutions successfully. A variant of PSO, called as Improved PSO has been developed in this paper and is hybridized with th...
متن کاملThree Hybrid Metaheuristic Algorithms for Stochastic Flexible Flow Shop Scheduling Problem with Preventive Maintenance and Budget Constraint
Stochastic flexible flow shop scheduling problem (SFFSSP) is one the main focus of researchers due to the complexity arises from inherent uncertainties and also the difficulty of solving such NP-hard problems. Conventionally, in such problems each machine’s job process time may encounter uncertainty due to their relevant random behaviour. In order to examine such problems more realistically, fi...
متن کاملImproved Particle Swarm Optimization for Solving Multiprocessor Scheduling Problem: Enhancements and Hybrid Methods
Memetic algorithms (MAs) are hybrid evolutionary algorithms (EAs) that combine global and local search by using an EA to perform exploration while the local search method performs exploitation. Combining global and local search is a strategy used by many successful global optimization approaches, and MAs have in fact been recognized as a powerful algorithmic paradigm for evolutionary computing....
متن کاملA memetic algorithm combined particle swarm optimization with simulated annealing and its application on multiprocessor scheduling problem
A memetic algorithm, which combines globe search with local search strategies, is presented to deal with the multiprocessor scheduling problem(MSP). During the processes, an improved particle swarm optimization is employed to execute the globe search optimization, and the simulated annealing is adopted to improve the quality of the selected candidates based on a certain strategy. Simulations sh...
متن کاملOn Performance Comparisons of GA, PSO and proposed Improved PSO for Job Scheduling in Multiprocessor Architecture
Job Scheduling in a Multiprocessor architecture is an extremely difficult NP hard problem, because it requires a large combinatorial search space and also precedence constraints between the processes. For the effective utilization of multiprocessor system, efficient assignment and scheduling of jobs is more important. This paper proposes a new improved Particle Swarm Optimization (ImPSO) algori...
متن کامل